New Objective Function for Vertical Partitioning in Database System
نویسندگان
چکیده
In this paper we introduce the objective function for vertical partitioning in database systems. It has been built with the new evaluative criterion: cache hit probability. Testing the validity of the derived evaluative formula via program simulation shows its high accuracy.
منابع مشابه
A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...
متن کاملA Formal Approach to the Vertical Partitioning Problemin Distributed Database
The design of distributed databases is an optimization problem requiring solutions to several interrelated problems: data fragmentation, allocation, and local optimization. Each problem can be solved with several diierent approaches thereby making the distributed database design a very diicult task. Although there is a large body of work on the design of data fragmentation, most of them are eit...
متن کاملMulti Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملA Vertical Partitioning Algorithm for Distributed Multimedia Databases
Efficient retrieval of multimedia objects is a key factor for the success of distributed multimedia databases. One way to provide faster access to multimedia objects in these databases is using vertical partitioning. In this paper, we present a vertical partitioning algorithm for distributed multimedia databases (MAVP) that takes into account the size of the multimedia objects in order to gener...
متن کاملSlop based Partitioning for Vertical Fragmentation in Distributed Database System
A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Vertical Partitioning puts frequently accessed attributes of the relation together in a fragment. Various researchers have proposed different algorithms for Vertical Partitioning. Still, there is a scope of improvement in previous algorithms for Vertical Partitioning. In this paper a new algorithm i...
متن کامل